Kolakoski sequence: links between recurrence, symmetry and limit density

نویسندگان

چکیده

The Kolakoski sequence $S$ is the unique element of \(\left\lbrace 1,2 \right\rbrace^{\omega}\) starting with 1 and coinciding its own run length encoding. We use parity lengths particular subclasses initial words \(S\) as a unifying tool to address links between main open questions - recurrence, mirror/reversal invariance asymptotic density digits. In we prove that recurrence implies reversal invariance, give sufficient conditions which would imply 1s \(\frac{1}{2}\).

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounds for the Kolakoski Sequence

The Kolakoski sequence (Kn) is perhaps one of the most famous examples of selfdescribing sequences for which some problems are still open. In particular, one does not know yet whether the density of 1’s in this sequence is equal to 12 . This work, which does not answer this question, provides explicit bounds for the main sequences related to (Kn). The proofs rest on a new identity involving the...

متن کامل

Letter Frequencies in the Kolakoski Sequence

The classical Kolakoski sequence K = (Kn) ∞ n=1 is the unique sequence on the alphabet {1, 2} de ned as the sequence of its own symbols' run lengths starting with a 1. The classical Kolakoski sequence was rst studied in a work by Oldenburger [1], where it appears as the unique solution to the problem of a trajectory on the alphabet {1, 2} which is identical to its exponent trajectory. The name ...

متن کامل

Kolakoski-(2m, 2n) Are Limit-periodic Model Sets

We consider (generalized) Kolakoski sequences on an alphabet with two even numbers. They can be related to a primitive substitution rule of constant length l. Using this connection, we prove that they have pure point dynamical and pure point diffractive spectrum, where we make use of the strong interplay between these two concepts. Since these sequences can then be described as model sets with ...

متن کامل

A Recursive Formula for the Kolakoski Sequence A000002

We present a recursive formula for the nth term of the Kolakoski sequence. Using this formula, it is easy to find recursions for the number of ones in the first n terms and for the sum of the first n terms of the Kolakoski sequence.

متن کامل

Generalized Staircases: Recurrence and Symmetry

We study infinite translation surfaces which are Z-covers of compact translation surfaces. We obtain conditions ensuring that such surfaces have Veech groups which are Fuchsian of the first kind and give a necessary and sufficient condition for recurrence of their straight-line flows. Extending results of Hubert and Schmithüsen, we provide examples of infinite non-arithmetic lattice surfaces, a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Open journal of discrete applied mathematics

سال: 2021

ISSN: ['2617-9679', '2617-9687']

DOI: https://doi.org/10.30538/psrp-odam2021.0052